Incompleteness, Undecidability and Automated Proofs - (Invited Talk)
نویسندگان
چکیده
Incompleteness and undecidability have been used for many years as arguments against automatising the practice of mathematics. The advent of powerful computers and proof-assistants – programs that assist the development of formal proofs by human-machine collaboration – has revived the interest in formal proofs and diminished considerably the value of these arguments. In this paper we discuss some challenges proof-assistants face in handling undecidable problems – the very results cited above – using for illustrations the generic proof-assistant Isabelle.
منابع مشابه
Notes on Undecidability and Incompleteness
Let Q be Robinson’s weak theory of arithmetic. We use recursiontheoretical methods to show that Q is essentially undecidable. Consequently, any recursively axiomatizable theory in which Q is interpretable is undecidable and incomplete. This is a strengthening of theorems of Gödel, Rosser and Tarski. We also present proofs of Gödel’s First and Second Incompleteness Theorems. In these proofs, the...
متن کاملReflections on Concrete Incompleteness
How do we prove true, but unprovable propositions? Gödel produced a statement whose undecidability derives from its “ad hoc” construction. Concrete or mathematical incompleteness results, instead, are interesting unprovable statements of Formal Arithmetic. We point out where exactly lays the unprovability along the ordinary mathematical proofs of two (very) interesting formally unprovable propo...
متن کاملUndecidable properties on the dynamics of reversible one-dimensional cellular automata
Many properties of the dynamics of one-dimensional cellular automata are known to be undecidable. However, the undecidability proofs often rely on the undecidability of the nilpotency problem, and hence cannot be applied in the case the automaton is reversible. In this talk we review some recent approaches to prove dynamical properties of reversible 1D CA undecidable. Properties considered incl...
متن کاملInvited talk: Developments, Libraries and Automated Theorem Provers
When formalizing a mathematical development with an interactive prover, it is helpful if the user can interface with a library (to avoid starting from scratch) and with automated provers (to avoid needing to give full details explicitly). We will consider an example of a development in Mizar, leading to some discussion of how one can interact with Mizar's library and how automated theorem prove...
متن کاملTowards Automated Proving of Relational Properties of Probabilistic Programs (Invited Talk)
Some security properties go beyond what is expressible in terms of an individual execution of a single program. In particular, many security policies in cryptography can be naturally phrased as relational properties of two open probabilistic programs. Writing and verifying proofs of such properties is an error-prone task that calls for automation and tool support. One of the main difficulties i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016